On LLP(k) grammars and languages

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Probabilistic Grammars and Languages

A classic theorem of Ellis (1970) asserts that there are probabilistic languages (p-languages) that are not generated by any probabilistic finite state grammar (PFSG) even though their support (the set of strings with nonzero probability) is regular. Ellis’ proof is highly algebraic, and gives no indication why such p-languages exist. Suppes (1970) argued that Ellis’ construction is an artefact...

متن کامل

On K(o) Grammars and Languages

Several definitions of the U(R) grammars can be found in the literature. Since the left-corner grammars can be defined as a restricted class of LR( k) grammars, there are also several definitions of the LC( k) grammars. Two such definitions are compared. For the case k = 0, these definitions are not equivalent. A characterization of the K(O) languages is given in terms of the simple determinist...

متن کامل

Free Grammars and Languages

Floyd’s Operator Precedence languages (OPLs) were originally introduced to support deterministic parsing of programming languages [11]; then, interest in them decayed for several decades, probably due to the advent of more expressive grammars, such as LR ones which also allow for efficient deterministic parsing. Recently, however, we renewed our interest in this family of languages on the basis...

متن کامل

Simple Chain Grammars and Languages

A subclass of the LR(O)-grammars, the class of simple chain grammars is introduced. Although there exist simpio chain grammars which are not LL(k) for any k > 0, this new class of grammars is very closely related to the LL(1) and simple LL(1) grammars. In fact it can be shown that every simple chain grammar has an equivalent simple LL(1) grammar. Cover properties for simple chain grammars are i...

متن کامل

Indexed Languages and Unification Grammars

T h e occu rren ce o f purely syn tactica l cross-serial depen den cies in S w iss-G erm an show s that con text-free gram m ars can n ot describe the string sets o f natu ral lan­ guage [Shi85]. T h e least class in the C h om sk y hierarchy th at can d escribe u n lim ited cross-serial depen dencies is in dexed g ram m ars [A h o 68]. G azd a r discuss in [G a z88] the ap p licab ility o f in...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theoretical Computer Science

سال: 1981

ISSN: 0304-3975

DOI: 10.1016/0304-3975(81)90073-6